The vehicle routing problem with pickups and deliveries on some special graphs

نویسندگان

  • Tali Eilam-Tzoreff
  • Daniel Granot
  • Frieda Granot
  • Greys Sosic
چکیده

The vehicle routing with pickups and deliveries (VRPD) problem is de6ned over a graph G=(V; E). Some vertices in G represent delivery customers who expect deliveries from a depot, and other vertices in G represent pickup customers who have available supply to be picked up and transported to a depot. The objective is to 6nd a minimum length tour for a capacitated vehicle, which starts at a depot and travels in G while satisfying all the requests by the delivery and pickup customers, without violating the vehicle capacity constraint, and returns to a depot. We study the VRPD problem on some special graphs, including trees, cycles and warehouse graphs when the depots are both exogenously and endogenously determined. Speci6cally, we develop linear time algorithms for the VRPD problem on tree graphs and polynomial algorithms on cycle and warehouse graphs. ? 2002 Elsevier Science B.V. All rights reserved. MSC: 68Q25; 05C05; 05C38; 90B10

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. T...

متن کامل

Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows

The Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP) has attracted great interest in research due to its potential cost savings to transportation and logistics operators. There exist several extensions of VRPSDP, and among these extensions, Simultaneous Deliveries and Pickups with Split Loads Problem (SDPSLP) is particularly proposed for eliminating the vehicle capacity...

متن کامل

The Vehicle Routing Problem with Divisible Deliveries and Pickups

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Nagy, Gábor and Wassan, Niaz A. and Speranza, M. Grazia and Archetti, Claudia (2015) The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science . pp. 271-294. ISSN 0041-...

متن کامل

Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

The Vehicle Routing Problem with Pickups and Deliveries (VRPPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods. We do not make the assumption common in the VRPPD literature, that goods may only be picked up after all deliveries have been completed. We also eschew the concept of insertion and propose a method that treats pickups an...

متن کامل

A Novel Discrete Differential Evolution Algorithm

Aiming at the stochastic vehicle routing problems with simultaneous pickups and deliveries, a novel discrete differential evolution algorithm is proposed for routes optimization. The algorithm can directly be used for the discrete domain by special design. Computational simulations and comparisons based on two kinds of problems of different sizes of SVRPSPD are provided. Results demonstrate tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2002